Duals of linearized Reed–Solomon codes
نویسندگان
چکیده
We give a description of the duals linearized Reed–Solomon codes in terms obtained by taking residues Ore rational functions. Our construction shows particular that, under some assumptions on base field, class is stable duality. As byproduct our work, we develop theory setting, extending results [7].
منابع مشابه
Linear codes with complementary duals
A linear code with a complementary dual (or an LCD code) is defined to be a linear code C whose dual code C⊥ satisfies C ∩ C⊥ = {0}. The algebraic characterization of LCD codes is given, and it is shown that asymptotically good LCD codes exist. LCD codes are shown to provide an optimum linear coding solution for the two-user binary adder channel. The nearest-neighbor (or maximum-likelihood) dec...
متن کاملOn the duals of binary BCH codes
We give bounds for the minimal distance of duals of binary BCH codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.
متن کاملLinearized Reed-Solomon codes and linearized Wenger graphs
Let m, d and k be positive integers such that k ≤ me , where e = (m, d). Let p be an prime number and π a primitive element of Fpm . To each ~a = (a0, · · · , ak−1) ∈ F k pm , we associate the linearized polynomial f~a(x) = k−1 ∑ j=0 ajx p . And, to each f~a(x), we associated the sequence c~a = (f~a(1), f~a(π), · · · , f~a(π pm−2)). Let C = {c~a | ~a ∈ F k pm} be the cyclic code formed by the s...
متن کاملZ2-Triple cyclic codes and their duals
A Z2-triple cyclic code of block length (r,s, t) is a binary code of length r + s+ t such that the code is partitioned into three parts of lengths r, s and t such that each of the three parts is invariant under the cyclic shifts of the coordinates. Such a code can be viewed as Z2[x]-submodules of Z2[x] 〈xr−1〉 × Z2[x] 〈xs−1〉 × Z2[x] 〈xt−1〉 , in polynomial representation. In this paper, we determ...
متن کاملCYCLIC CODES AND THEIR DUALS OVER Zm
In this paper we study the cyclic codes over Zm as being Zm-submodules of ZmG and we find their minimal generating sets. We also study the dual codes of cyclic codes and find their generators as being ideals in ZmG. Throughout this paper, we assume m = q, q is a prime number and (n, q) = 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2022
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-022-01102-7